Sensitivity Analysis of Optimal Control Problems with Bang–Bang Controls
نویسندگان
چکیده
We study bang–bang control problems that depend on a parameter p. For a fixed nominal parameter p0, it is assumed that the bang-bang control has finitely many switching points and satisfies second order sufficient conditions (SSC). SSC are formulated and checked in terms of an associated finitedimensional optimization problem w.r.t. the switching points and the free final time. We show that the nominal optimal bang– bang control can be locally embedded into a parametric family of optimal bang–bang controls where the switching points are differentiable function of the parameter. A well known sensitivity formula from optimization [7] is used to compute the parametric sensitivity derivatives of the switching points which also allows to determine the sensitivity derivatives of the optimal state trajectories.
منابع مشابه
Solution of Bang-Bang Optimal Control Problems by Using Bezier Polynomials
In this paper, a new numerical method is presented for solving the optimal control problems of Bang-Bang type with free or fixed terminal time. The method is based on Bezier polynomials which are presented in any interval as $[t_0,t_f]$. The problems are reduced to a constrained problems which can be solved by using Lagrangian method. The constraints of these problems are terminal state and con...
متن کاملCOMPARISON BETWEEN MINIMUM AND NEAR MINIMUM TIME OPTIMAL CONTROL OF A FLEXIBLE SLEWING SPACECRAFT
In this paper, a minimum and near-minimum time optimal control laws are developed and compared for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The control commands are considered as typical bang-bang with multiple symmetrical switches, the time optimal control solution for the rigid-body mode is obtained as a bang-bang function and app...
متن کاملUsing Modified IPSO-SQP Algorithm to Solve Nonlinear Time Optimal Bang-Bang Control Problem
In this paper, an intelligent-gradient based algorithm is proposed to solve time optimal bang-bang control problem. The proposed algorithm is a combination of an intelligent algorithm called improved particle swarm optimization algorithm (IPSO) in the first stage of optimization process together with a gradient-based algorithm called successive quadratic programming method (SQP) in the second s...
متن کاملCONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM
A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...
متن کاملNear-Minimum Time Optimal Control of Flexible Spacecraft during Slewing Maneuver
The rapid growth of space utilization requires extensive construction, and maintenance of space structures and satellites in orbit. 
This will, in turn, substantiate application of robotic systems in space. In this paper, a near-minimum-time optimal control law is developed for a rigid space platform with flexible links during an orientating maneuver with large angle of rotation. The time op...
متن کامل